O ] 1 2 A ug 2 01 7 Succinctness in subsystems of the spatial μ - calculus
نویسندگان
چکیده
In this paper we systematically explore questions of succinctness in modal logics employed in spatial reasoning. We show that the closure operator, despite being less expressive, is exponentially more succinct than the limit-point operator, and that the μ-calculus is exponentially more succinct than the equally-expressive tangled limit operator. These results hold for any class of spaces containing at least one crowded metric space or containing all spaces based on ordinals below ω, with the usual limit operator. We also show that these results continue to hold even if we enrich the less succinct language with the universal modality.
منابع مشابه
ar X iv : 1 71 0 . 08 99 6 v 1 [ cs . L O ] 2 4 O ct 2 01 7 Permutation Games for the Weakly Aconjunctive
We introduce a natural notion of limit-deterministic parity automata and present a method that uses such automata to construct satisfiability games for the weakly aconjunctive fragment of the μ-calculus. To this end we devise a method that determinizes limit-deterministic parity automata of size n with k priorities through limit-deterministic Büchi automata to deterministic parity automata of s...
متن کاملar X iv : h ep - t h / 01 05 31 7 v 2 4 A ug 2 00 1 Single - channel correlators and residue calculus
Some simple (namely, single-channel) correlation functions involving an arbitrary number of fields are computed by means of a direct application of the residue calculus, through partial fraction expansions. Examples are presented in minimal models and parafermionic conformal theories. A generic factorized expression is deduced for the corresponding single-channel structure constants.
متن کاملParity Games and Automata for Game Logic (Extended Version)
Parikh’s game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that represent the strategic power of players in determined two-player games. Game logic translates into a fragment of the monotone μ-calculus, which in turn is expressively equivalent to monotone modal automata. Parity games and automata are important tools for dealing with the combinatorial complexit...
متن کاملParity Games and Automata for Game Logic
Parikh’s game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that represent the strategic power of players in determined two-player games. Game logic translates into a fragment of the monotone μ-calculus, which in turn is expressively equivalent to monotone modal automata. Parity games and automata are important tools for dealing with the combinatorial complexit...
متن کاملar X iv : 0 71 0 . 24 19 v 1 [ cs . L O ] 1 2 O ct 2 00 7 The Variable Hierarchy for the Games μ - Calculus
Parity games are combinatorial representations of closed Boolean μ-terms. By adding to them draw positions, they have been organized by Arnold and one of the authors [1, 2] into a μ-calculus [3]. As done by Berwanger et al. [4, 5] for the propositional modal μ-calculus, it is possible to classify parity games into levels of hierarchy according to the number of fixed-point variables. We ask whet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017